Iterative hard-decision decoding of combined cyclic codes
نویسندگان
چکیده
منابع مشابه
Iterative Threshold Decoding Of High Rates Quasi-Cyclic OSMLD Codes
Majority logic decoding (MLD) codes are very powerful thanks to the simplicity of the decoder. Nevertheless, to find constructive families of these codes has been recognized to be a hard job. Also, the majority of known MLD codes are cyclic which are limited in the range of the rates. In this paper a new adaptation of the Iterative threshold decoding algorithm is considered, for decoding Quasi-...
متن کاملAlgebraic So- and Hard-Decision Decoding of Generalized Reed–Solomon and Cyclic Codes
and Résumé T challenges in algebraic coding theory are addressed within this dissertation. e rst one is the ecient hardand so-decision decoding of Generalized Reed–Solomon codes over nite elds in Hamming metric. e motivation for this more than 50 years old problem was renewed by the discovery of a polynomial-time interpolation-based decoding principle up to the Johnson radius by Guruswam...
متن کاملAlgebraic soft- and hard-decision decoding of generalized reed-solomon and cyclic codes
and Résumé T challenges in algebraic coding theory are addressed within this dissertation. e rst one is the ecient hardand so-decision decoding of Generalized Reed–Solomon codes over nite elds in Hamming metric. e motivation for this more than 50 years old problem was renewed by the discovery of a polynomial-time interpolation-based decoding principle up to the Johnson radius by Guruswam...
متن کاملIterative Algebraic Soft Decision Decoding of Reed-Solomon Codes
In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood performance. The advantage of this decoding algorithm over previously proposed algorithms is its fast convergence in terms of the number of iterations required. This is achieved by combining two powerful soft decision decoding techniques which were previously regarded in the ...
متن کاملHard decision decoding of binary low-density codes based on extended Hamming codes
In this paper we investigate decoding performance of binary low-density codes based on extended Hamming codes, using a hard decision decoding algorithm similar to Gallager’s bit-flipping algorithm. The possibilities to implement the decoder in hardware are also discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eastern-European Journal of Enterprise Technologies
سال: 2018
ISSN: 1729-4061,1729-3774
DOI: 10.15587/1729-4061.2018.123207